/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
   ListNode* dummy=new ListNode(0);
   dummy->next =head;
   ListNode*cur = dummy;
   while(cur->next){
       if(cur->next->val==val){
           cur->next=cur->next->next;
       } else{
           cur=cur->next;
       }
       
   }
   return dummy->next;
    }
};